#include<iostream>

using namespace std;

struct TreeNode {
    int val;
    TreeNode* left;
    TreeNode* right;
    TreeNode() : val(0), left(nullptr), right(nullptr) {}
    TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
    TreeNode(int x, TreeNode* left, TreeNode* right) : val(x), left(left), right(right) {}
    
};

class Solution {
public:
    bool evaluateTree(TreeNode* root) {
        return dfs(root);
    }

    bool dfs(TreeNode* root)
    {
        if (root->left == nullptr)
        {
            return root->val == 1 ? true : false;
        }

        bool left = dfs(root->left);
        bool right = dfs(root->right);

        if (root->val == 2)
        {
            return left | right;
        }
        else
        {
            return left & right;
        }

    }
};

int main()
{
    return 0;
}